Optimal tree structures for group key tree management considering insertion and deletion cost
نویسندگان
چکیده
منابع مشابه
Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
We study the optimal structure for group broadcast problem where the key tree model is extensively used. The objective is usually to find an optimal key tree to minimize the cost based on certain assumptions. Under the assumption that n members arrive in the initial setup period and only member deletions are allowed after that period, previous works show that when only considering the deletion ...
متن کاملOptimal Tree Structures for Group Key Management with Batch Updates
We investigate the key management problem for broadcasting applications. Previous work showed that batch rekeying can be more cost-effective than individual rekeying. Under the assumption that every user has probability p of being replaced by a new user during a batch rekeying period, we study the structure of the optimal key trees. Constant bounds on both the branching degree and the subtree s...
متن کاملAsymptotically Optimal Tree-based Group Key Management Schemes
In key management schemes that realize secure multicast communications encrypted by group keys on a public network, tree structures are often used to update the group keys efficiently. Selçuk and Sidhu have proposed an efficient scheme which updates dynamically the tree structures based on the withdrawal probabilities of members. In this paper, it is shown that Selçuk-Sidhu scheme is asymptotic...
متن کاملHRKT: A Hierarchical Route Key Tree based Group Key Management for Wireless Sensor Networks
In wireless sensor networks (WSNs), energy efficiency is one of the most essential design considerations, since sensor nodes are resource constrained. Group communication can reduce WSNs communication overhead by sending a message to multiple nodes in one packet. In this paper, in order to simultaneously resolve the transmission security and scalability in WSNs group communications, we propose ...
متن کاملMultiway Tree-Based Group Key Management Using Chinese Remainder Theorem for Multi-Privileged Group Communications
Key management becomes more difficult in multi-privileged communications due to the dynamic membership and the complex relations between users and resources. In this paper, we propose a novel key management scheme in which the key graph is based on multiway trees. Chinese remainder theorem is employed to combine some encrypted rekeying materials into a short message for rekeying. As a result, u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.02.039